#include <stdio.h>

int isPrime(int n);
int Goldbach(int n);

int main(){
    int num, count = 0,cnt = 1;
    scanf("%d,%d", &num, &count);
    if (num < 6) num = 6;
    if (num % 2) num++;
    while (cnt <= count)
    {
        if(Goldbach(num)){
            cnt++;
        }
        num += 2;
    }
    return 0;
}

int isPrime(int n){
    if (n <= 1) return 0;
    if (n == 2) return 1;
    if (n % 2 == 0) return 0;
    for (int i = 3; i * i <= n; i += 2){
        if (n % i == 0) return 0;
    }
    return 1;
}

int Goldbach(int n){
    for (int i = 2; i <= n / 2; i++){
        if (isPrime(i) && isPrime(n - i)){
            printf("%d=%d+%d\n", n, i, n - i);
            return 1;
            break;
        }
    }
    return 0;
}
